Solving the train dispatching problem via deep reinforcement learning

نویسندگان

چکیده

Every day, railways experience disturbances and disruptions, both on the network fleet side, that affect stability of rail traffic. Induced delays propagate through network, which leads to a mismatch in demand offer for goods passengers, and, turn, loss service quality. In these cases, it is duty human traffic controllers, so-called dispatchers, do their best minimize impact However, dispatchers inevitably have limited depth perception knock-on effect decisions, particularly how they areas are outside direct control. recent years, much work Decision Science has been devoted developing methods solve problem automatically support this challenging task. This paper investigates Machine Learning-based tackling problem, proposing two different Deep Q-Learning methods(Decentralized Centralized). Numerical results show superiority techniques respect classical linear based matrices. Moreover Centralized approach compared with MILP formulation showing interesting results. The experiments inspired data provided by U.S. class 1 railroad.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deep Reinforcement Learning for Solving the Vehicle Routing Problem

We present an end-to-end framework for solving Vehicle Routing Problem (VRP) using deep reinforcement learning. In this approach, we train a single model that finds near-optimal solutions for problem instances sampled from a given distribution, only by observing the reward signals and following feasibility rules. Our model represents a parameterized stochastic policy, and by applying a policy g...

متن کامل

Problem solving with reinforcement learning

This thesis is concerned with practical issues surrounding the application of reinforcement learning techniques to tasks that take place in high dimensional continuous state-space environments. In particular, the extension of on-line updating methods is considered, where the term implies systems that learn as each experience arrives, rather than storing the experiences for use in a separate oo-...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

The track formulation for the Train Dispatching problem

With few exceptions, train movements are still controlled by human operators, the dispatchers. They establish routes and precedence between trains in real-time in order to cope with normal operations but also to recover from deviations from the timetable, and minimize overall delays. Implicitly they tackle and solve repeatedly a hard optimization problem, the Train Dispatching Problem. We recen...

متن کامل

Shared Autonomy via Deep Reinforcement Learning

In shared autonomy, user input is combined with semi-autonomous control to achieve a common goal. The goal is often unknown ex-ante, so prior work enables agents to infer the goal from user input and assist with the task. Such methods tend to assume some combination of knowledge of the dynamics of the environment, the user’s policy given their goal, and the set of possible goals the user might ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Rail Transport Planning & Management

سال: 2023

ISSN: ['2210-9714', '2210-9706']

DOI: https://doi.org/10.1016/j.jrtpm.2023.100394